Higher-order topological sensitivity analysis for the Laplace operator
نویسندگان
چکیده
منابع مشابه
Weighted Graph Laplace Operator under Topological Noise
Recently, various applications have motivated the study of spectral structures (eigenvalues and eigenfunctions) of the so-called Laplace-Beltrami operator of a manifold and their discrete versions. A popular choice for the discrete version is the so-called Gaussian weighted graph Laplacian which can be applied to point cloud data that samples a manifold. Naturally, the question of stability of ...
متن کاملHigh-Order AFEM for the Laplace-Beltrami Operator: Convergence Rates
We present a new AFEM for the Laplace-Beltrami operator with arbitrary polynomial degree on parametric surfaces, which are globally W 1 ∞ and piecewise in a suitable Besov class embedded in C1,α with α ∈ (0, 1]. The idea is to have the surface sufficiently well resolved in W 1 ∞ relative to the current resolution of the PDE in H1. This gives rise to a conditional contraction property of the PDE...
متن کاملA Graph-based Approach for Higher Order Gis Topological Analysis
Retrieving structured information from an initial random collection of objects may be carried out by understanding the spatial arrangement between them, assuming no prior knowledge about those objects. As far as topology is concerned, contemporary desktop GIS packages do not generally support further analysis beyond adjacency. Thus, one of the original motivations of this work was to develop ne...
متن کاملTopological Sensitivity Analysis for High Order Elliptic Operators
The topological derivative is defined as the first term of the asymptotic expansion of a given shape functional with respect to a small parameter that measures the size of a singular domain perturbation. It has applications in many different fields such as shape and topology optimization, inverse problems, image processing and mechanical modeling including synthesis and/or optimal design of mic...
متن کاملHigher-order Operator Precedence Languages
Floyd’s Operator Precedence (OP) languages are a deterministic context-free family having many desirable properties. They are locally and parallely parsable, and languages having a compatible structure are closed under Boolean operations, concatenation and star; they properly include the family of Visibly Pushdown (or Input Driven) languages. OP languages are based on three relations between an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Mathematique
سال: 2016
ISSN: 1631-073X
DOI: 10.1016/j.crma.2016.09.002